Problem set 1: Answers
نویسنده
چکیده
So, suppose that i ◦ f : Z → X is continuous. Since for every α, the projection πα : X → Xα is continuous, πα ◦ (i ◦ f) : Z → Xα is continuous. The map πα ◦ (i ◦ f) = iα ◦ (ρα ◦ f). By the universal property of the subspace topology on Yα, the map iα ◦ (ρα ◦ f) being continuous implies ρα ◦ f : Z → Yα is continuous. So, we have a collection of continuous maps: ρα ◦ f : Z → Yα so by the universal property of the product topology on Y , the map f : Z → Y is continuous. On the other hand, suppose that f : Z → Y is continuous. Because the projections ρα : Y → Yα are all continuous, the compositions ρα ◦f : Z → Yα are all continuous. Since the inclusions iα : Yα → Xα are all continuous, the compotisions, iα ◦ ρα ◦ f : Z → Xα are all continuous. Note the maps iα ◦ρα ◦f = πα ◦ (i◦f), and the universal
منابع مشابه
Optimal quorum for a reliable Desktop grid
We consider a reliable desktop grid solving multiple tasks with answers from a given set. Wrong answer can be obtained with some small probability p: reliability means that p is small with respect to 1−p. Penalty is added to the computation cost if a wrong answer is believed to. We consider the optimization problem of choosing the quorum in case of finite set of possible answers, countable set,...
متن کاملDistinguishing Answers in Conceptual Graph Knowledge Bases
In knowledge bases (KB), the open world assumption and the ability to express variables may lead to an answer redundancy problem. This problem occurs when the returned answers are comparable. In this paper, we define a framework to distinguish amongst answers. Our method is based on adding contextual knowledge extracted from the KB. The construction of such descriptions allows clarification of ...
متن کاملWorking Paper: Information-based Computational Complexity
I. Complexity is the reason searches are slow. What complexity? The number of possible answers. How many are there? II. Problems, Solutions, and Models A. Define the concept of the base problem. 1. When a problem is first posed there is an underlying context called the base context denoted CB. Let’s call the original problem the base problem PB. Problem can be expected to have certain informati...
متن کاملRewriting Conjunctive Queries Determined by Views
Answering queries using views is the problem which examines how to derive the answers to a query when we only have the answers to a set of views. Constructing rewritings is a widely studied technique to derive those answers. In this paper we consider the problem of existence of rewritings in the case where the answers to the views uniquely determine the answers to the query. Specifically, we sa...
متن کاملارائه روشی پویا جهت پاسخ به پرسوجوهای پیوسته تجمّعی اقتضایی
Data Streams are infinite, fast, time-stamp data elements which are received explosively. Generally, these elements need to be processed in an online, real-time way. So, algorithms to process data streams and answer queries on these streams are mostly one-pass. The execution of such algorithms has some challenges such as memory limitation, scheduling, and accuracy of answers. They will be more ...
متن کاملOn Computing Constraint Abduction Answers
We address the problem of computing and representing answers of constraint abduction problems over the Herbrand domain. This problem is of interest when performing type inference involving generalized algebraic data types. We show that simply recognizing a maximally general answer or fully maximal answer is co-NP complete. However we present an algorithm that computes the (finite) set of fully ...
متن کامل